#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define in read<int>()
#define lin read<ll>()
#define rep(i, x, y) for(int i = (x); i <= (y); i++)
#define per(i, x, y) for(int i = (x); i >= (y); i--)

using namespace std;

using ll = long long;
using db = double;
using pii = pair < int, int >;
using vec = vector < int >;
using veg = vector < pii >;

template < typename T > T read() {
	T x = 0; bool f = 0; char ch = getchar();
	while(!isdigit(ch)) f |= ch == '-', ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar();
	return f ? -x : x;
}

template < typename T > void chkmax(T &x, const T &y) { x = x > y ? x : y; }
template < typename T > void chkmin(T &x, const T &y) { x = x < y ? x : y; }

const int N = 2e4 + 10;

int n, K, d[N], c[N], s[N], w[N], st[N], ed[N];
ll f[N];
vec pot[N];

namespace seg {
	ll val[N << 2], tg[N << 2];
	void pt(int x, ll v) { val[x] += v; tg[x] += v; }
	void pd(int x) { if(tg[x]) pt(x << 1, tg[x]), pt(x << 1 | 1, tg[x]), tg[x] = 0; }
	void pu(int x) { val[x] = min(val[x << 1], val[x << 1 | 1]); }
	void upd(int xl, int xr, int v, int o = 1, int l = 1, int r = n) {
		if(xl == l && xr == r) return pt(o, v); pd(o); int mid = l + r >> 1;
		if(xr <= mid) upd(xl, xr, v, o << 1, l, mid); else if(xl > mid) upd(xl, xr, v, o << 1 | 1, mid + 1, r);
		else upd(xl, mid, v, o << 1, l, mid), upd(mid + 1, xr, v, o << 1 | 1, mid + 1, r); pu(o);
	}
	ll query(int xl, int xr, int o = 1, int l = 1, int r = n) {
		if(xl == l && xr == r) return val[o]; pd(o); int mid = l + r >> 1;
		if(xr <= mid) return query(xl, xr, o << 1, l, mid); else if(xl > mid) return query(xl, xr, o << 1 | 1, mid + 1, r);
		else return min(query(xl, mid, o << 1, l, mid), query(mid + 1, xr, o << 1 | 1, mid + 1, r));
	}
	void build(int o = 1, int l = 1, int r = n) {
		if(l == r) return val[o] = f[l], void(); tg[o] = 0; int mid = l + r >> 1;
		build(o << 1, l, mid); build(o << 1 | 1, mid + 1, r); pu(o);
	}
}

int main() {
#ifndef ONLINE_JUDGE
	freopen("1.in", "r", stdin);
#endif
	n = in, K = in; rep(i, 2, n) d[i] = in; rep(i, 1, n) c[i] = in; rep(i, 1, n) s[i] = in; rep(i, 1, n) w[i] = in;
	++n, ++K; d[n] = 2e9; s[n] = 0; c[n] = 0; w[n] = 0;
	rep(i, 1, n) {
		st[i] = lower_bound(d + 1, d + n + 1, d[i] - s[i]) - d;
		ed[i] = upper_bound(d + 1, d + n + 1, d[i] + s[i]) - d - 1;
		pot[ed[i]].eb(i);
	}
	ll cur = 0;
	rep(i, 1, n) {
		f[i] = cur + c[i];
		for(auto v : pot[i]) cur += w[v];
	}
	rep(_, 2, K) {
		seg :: build();
		rep(i, 2, n) {
			chkmin(f[i], c[i] + seg :: query(1, i - 1));
			for(auto v : pot[i]) if(st[v] > 1) seg :: upd(1, st[v] - 1, w[v]);
		}
	} printf("%lld\n", f[n]);
	return 0;
}
